Dikin-Type Algorithms for Dextrous Grasping Force Optimization

One of the central issues in dextrous robotic hand grasping is to balance external forces acting on the object and at the same time achieve grasp slability and minimum grasping effort. A companion paper shows that the nonlinear friction-force limit constraints on grasping forces are equivalent to the positive definiteness of a certain matrix subject to linear constraints. Furthe~ compensation of the external object force is also a linear constraint on this matrix. Consequently, the task of grasping force optimization can be formulated as a problem with semidefinite constraints. In this papec two versions of strictly convex costfanctions, one of them self-concordant, are considered. These are twice-continuously dl~erentiable functions thut tend to infinity at the bounday of positive definiteness, For the general class of such cost finctions, Dikin~pe algorithms are presented. It is shown that the proposed algorithms guarantee convergence to the unique solution of the semidefinite programming problem associated with dextrous grasping force optimization, Numerical examples demonstrate the simplicip of implementation, the good numerical properties, and the optimality of the approach,